Single machine batch processing problem with release dates to minimize total completion time
نویسندگان
چکیده
منابع مشابه
Single machine batch scheduling problem with family setup times and release dates to minimize makespan
In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O n n m + 1 m time dynamic programming algorithm and an O(mk k P 2k−1) time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of di...
متن کاملApproximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time...
متن کاملSingle .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملA Branch and Bound Procedure to Minimize Total Tardiness or Total Completion time on One Machine with Different Release Dates
In this paper, we present a Branch and Bound procedure to minimize total tardiness on one machine with different release dates. We introduce a new lower bound and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. We also show how we can generalize different techniques to minimize total completion...
متن کاملThree-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times
The three-machine flowshop scheduling problem to minimize total completion time is studied where setup times are treated as separate from processing times. Setup and processing times of all jobs on all machines are unknown variables before the actual occurrence of these times. The lower and upper bounds for setup and processing times of each job on each machine is the only information that is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2018
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2017.8.003